Tiny Codes for Guaranteeable Delay

Delay diversity codes for frequency selective channels

Space-time coding for the flat fading, quasistatic MIMO wireless channel has received wide spread attention. This paper treats space-time code design for frequency selective channels from a single carrier modulation perspective. We present a general framework for analyzing space-time codes for delay spread channels based on PEP analysis. It is shown that as in the flat fading case, diversity ga...

Crypto for Tiny Objects

This work presents the first known implementation of elliptic curve cryptography for sensor networks, motivated by those networks’ need for an efficient, secure mechanism for shared cryptographic keys’ distribution and redistribution among nodes. Through instrumentation of UC Berkeley’s TinyOS, this work demonstrates that secret-key cryptography is already viable on the MICA2 mote. Through anal...

Low delay burst erasure correction codes

In a variety of networks, packet losses occur in bursts. Conventional application of error correcting codes for packet recovery often requires interleaving and long decoder delays. These long delays are usually unacceptable in real-time multimedia communication applications such as Voice over IP (VoIP). Consequently erasure correction codes with severe limits on delay are desirable. We present ...

Power-efficient Delay-insensitive Codes for Data Transmission

A Kraft-Type Inequality for d-Delay Binary Search Codes

Among the models of delayed search discussed in [1], [2], the simplest one can be formulated as the following two–player game. One player, say A, holds a secret number m ∈ M {1, 2, . . . ,M} and another player, say Q, tries to learn the secret number by asking A at time i questions, like “Is m ≥ xi?”, where xi is a number chosen by Q. The rule is that at time i+ d A must answer Q’s question at ...